Dynamically-Wiresized Elmore-Based Routing Constructions
نویسندگان
چکیده
We analyze the impact of wiresizing on the performance of Elmore-based routing constructions. Whereas previous wiresizing schemes are static (i.e., they wiresize an existing topology), we introduce a new dynamic wiresizing technique, which uses wire-sizing considerations to drive the routing construction itself. Simulations show that dynamic wiresiz-ing aaords superior performance over static wiresiz-ing, and also avoids topological degeneracies. Moreover , dynamically-wiresized Elmore-based routing constructions signiicantly outperform all previous methods (including A-Trees) in term of maximum source-sink signal delay, aaording up to 73% average SPICE delay improvement over traditional Steiner routing.
منابع مشابه
Near-optimal critical sink routing tree constructions
We present critical-sink routing tree (CSRT) constructions which exploit available critical-path information to yield high-performance routing trees. Our CS-Steiner and "global slack removal" algorithms together modify traditional Steiner tree constructions to optimize signal delay at identified critical sinks. We further propose an iterative Elmore routing tree (ERT) construction which optimiz...
متن کاملNear-Optimal Critical Sink Routing Tree Constructions - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
We present critical-sink routing tree (CSRT) constructions which exploit available critical-path information to yield high-performance routing trees. Our CS-Steiner and “global slack removal” algorithms together modify traditional Steiner tree constructions to optimize signal delay at identified critical sinks. We further propose an iterative Elmore routing tree (ERT) construction which optimiz...
متن کاملFidelity and Near-Optimality of Elmore-Based Routing Constructions
We address the eecient construction of interconnection trees with near-optimal delay properties. Our study begins from rst principles: we consider the accuracy and delity of easily-computed delay models (speciically, Elmore delay) with respect to the delay values computed from detailed simulation of underlying physical phenomena (e.g., SPICE simulator output). Our studies show that minimization...
متن کاملPlanar-DME: A Single-Layer Zero-Skew Clock Tree Router - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
This paper presents new single-layer, i.e., planarembeddable, clock tree constructions with exact zero skew under either the linear or the Elmore delay model. Our method, called Planar-DME, consists of two parts. The first algorithm, called Linear-Planar-DME, guarantees an optimal planar zero-skew clock tree (ZST) under the linear delay model. The second algorithm, called Elmore-Planar-DME, use...
متن کاملPlanar-DME: a single-layer zero-skew clock tree router
This paper presents new single-layer, i.e., planar-embeddable, clock tree constructions with exact zero skew under either the linear or the Elmore delay model. Our method, called Planar-DME, consists of two parts. The rst algorithm, called Linear-Planar-DME, guarantees an optimal planar zero-skew clock tree (ZST) under the linear delay model. The second algorithm, called ElmorePlanar-DME, uses ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994